consistent formalization

См. также в других словарях:

• Closed world assumption — The closed world assumption (CWA) is the presumption that what is not currently known to be true, is false. The same name also refers to a logical formalization of this assumption by Raymond Reiter. The opposite of the closed world assumption is… …   Wikipedia

• Mathematical logic — (also known as symbolic logic) is a subfield of mathematics with close connections to foundations of mathematics, theoretical computer science and philosophical logic.[1] The field includes both the mathematical study of logic and the… …   Wikipedia

• Gödel's incompleteness theorems — In mathematical logic, Gödel s incompleteness theorems, proved by Kurt Gödel in 1931, are two theorems stating inherent limitations of all but the most trivial formal systems for arithmetic of mathematical interest. The theorems are of… …   Wikipedia

• Halting problem — In computability theory, the halting problem can be stated as follows: Given a description of a computer program, decide whether the program finishes running or continues to run forever. This is equivalent to the problem of deciding, given a… …   Wikipedia

• Francisco Antônio Dória — Francisco Antônio de Moraes Accioli Dória (born 1945, Rio de Janeiro, Brazil) is a Brazilian mathematician, philosopher, and noted genealogist. Francisco Antônio Dória received his B.S. in Chemical Engineering from the Federal University at Rio… …   Wikipedia

• Interpretation of quantum mechanics — An interpretation of quantum mechanics is a statement which attempts to explain how quantum mechanics informs our understanding of nature. Although quantum mechanics has received thorough experimental testing, many of these experiments are open… …   Wikipedia

• PROSODY, HEBREW — This article is a survey of the history of Hebrew poetic forms from the Bible to the present time. The entry is arranged according to the following outline: introduction the variety of formal systems the specific nature of hebrew literary history …   Encyclopedia of Judaism

• Frame problem — In artificial intelligence, the frame problem was initially formulated as the problem of expressing a dynamical domain in logic without explicitly specifying which conditions are not affected by an action. John McCarthy and Patrick J. Hayes… …   Wikipedia

• Structural information theory — (SIT) is a theory about human perception and, in particular, about perceptual organization, that is, about the way the human visual system organizes a raw visual stimulus into objects and object parts. SIT was initiated, in the 1960s, by Emanuel… …   Wikipedia

• Axiom — This article is about logical propositions. For other uses, see Axiom (disambiguation). In traditional logic, an axiom or postulate is a proposition that is not proven or demonstrated but considered either to be self evident or to define and… …   Wikipedia

• Domain theory — is a branch of mathematics that studies special kinds of partially ordered sets (posets) commonly called domains. Consequently, domain theory can be considered as a branch of order theory. The field has major applications in computer science,… …   Wikipedia